The Split replacement policy for caches with prefetch blocks
ثبت نشده
چکیده
Prefetching is an inbuilt feature of file system and storage caches. The cache replacement policy plays a key role in the performance of prefetching techniques, since a miss occurs if a prefetch block is evicted before the arrival of the on-demand user request for the block. Prefetch blocks display spatial locality, but existing cache replacement policies are designed for blocks that display temporal locality. This paper develops a new replacement policy called Split for caches that implement prefetching. The relative performances of Split and other replacement policies, such as LRU, are evaluated using simulation and theoretical analysis. The evaluation shows that the Split replacement policy gets a higher hit rate and a lower response time than any of the other compared policies, at the cost of slightly more disk accesses.
منابع مشابه
Improve Prefetch Performance by Splitting the Cache Replacement Queue
The performance of a prefetch cache is dependent on both the prefetch technique and the cache replacement policy. Both these algorithms execute independently of each other, but they share a data structure the cache replacement queue. This paper shows that even with a simple prefetch technique, there is an increase in hit rate when the LRU replacement queue is split into two equal sized queues. ...
متن کاملReD: A Policy Based on Reuse Detection for Demanding Block Selection in Last-Level Caches
In this paper, we propose a new block selection policy for Last-Level Caches (LLCs) that decides, based on Reuse Detection, whether a block coming from main memory is inserted, or not, in the LLC. The proposed policy, called ReD, is demanding in the sense that blocks bypass the LLC unless their expected reuse behavior matches specific requirements, related either to their recent reuse history o...
متن کاملA Stack Model Based Replacement Policy for a NonVolatile Write Cache
The use of non-volatile write caches is an effective technique to bridge the performance gap between I/O systems and processor speed. Using such caches provides two benefits: some writes will be avoided because dirty blocks will be overwritten in the cache, and physically contiguous dirty blocks can be grouped into a single I/O operation. We present a new block replacement policy that efficient...
متن کاملA Smart Cache Designed for Embedded Applications
In this paper, we extend our previous investigation of split array and scalar data caches to embedded systems. More specifically we explore reconfigurable data caches where L-1 data caches are optimally partitioned into scalar caches augmented with victim caches and array caches. We do not change cache block size or set-associativities, making it easier to reconfigure cache banks. We also evalu...
متن کاملAn Improvement in WRP Block Replacement Policy with Reviewing and Solving its Problems
One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To o...
متن کامل